A Tractable Knowledge Representation Service with Full Introspection
نویسندگان
چکیده
A Knowledge Representation service for a knowledge-based system (or agent) can be viewed as providing, at the very least, two operations that (a) give precise information about what is and is not believed (ASg) and (b) add new facts to the knowledge base when they become available (TELL). An appropriate model of belief for such operations should support the notion that only certain facts are believed, in particular those that have been added to a knowledge base via TELL. For logically omniscient and fully introspective agents, models of this kind lead to intractable ASK and TELL operations. In this paper, we show that tractability can be retained by giving up logical omniscience, but without sacrificing full introspection. This is done within the framework of a propositional logic of belief. In particular, the logic allows us to express that only a sentence (or finite set of them) is believed. We show that the validity of certain classes of sentences involving belief can be decided efficiently. These results are then applied to the specification of efficient TELL and ASK operations. a Fellow of The Canadian Institute for Advanced Research
منابع مشابه
Distributed Autoepistemic Logic and its Application to Access Control
In this paper we define and study an extension of autoepistemic logic (AEL) called distributed autoepistemic logic (dAEL) with multiple agents that have full introspection in their own knowledge as well as in that of others. This mutual full introspection between agents is motivated by an application of dAEL in access control. We define 2and 3-valued semantic operators for dAEL. Using these ope...
متن کاملLimited Reasoning in First-Order Knowledge Bases with Full Introspection
A fundamental problem in knowledge representation is that reasoning, if based on classical logic, is inherently intractable or even undecidable. A principled approach to specifying more eecient inference mechanisms is to use weaker logics with non-standard model theories. In this paper we extend earlier work on a logic of belief for decidable deductive rst-order reasoning by adding the ability ...
متن کاملTractable Meta-Reasoning in Propositional Logics of Belief
Finding adequate semantic models of deductive reasoning is a difficult problem, if deductions are to be performed efficiently and in a semantically appropriate way. The model of reasoning provided by possible-worlds semantics has been found deficient both for computational and intuitive reasons. Existing semantic approaches that were proposed as alternatives to possible-worlds semantics either ...
متن کاملCase-Based Introspection
To effectively reason about one’s own knowledge, goals, and reasoning requires an ability to explicitly introspect. A computational model of introspection is a second-order theory that contains a formal language for representing first-order processes and that processes instances of this representation. The reasoning algorithm used to perform such processing is similar to the algorithm used to r...
متن کاملA Hybrid Architecture Combining Reactive Plan Execution and Reactive Learning
Developing software agents has been complicated by the problem of how knowledge should be represented and used. Many researchers have identified that agents need not require the use of complex representations, but in many cases suffice to use “the world” as their representation. However, the problem of introspection, both by the agents themselves and by (human) domain experts, requires a knowle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988